排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Let Dn be the set of all signed permutations on [n] = {1,... ,n} with even signs, and let :Dn(T) be the set of all signed permutations in Dn which avoids a set T of signed patterns. In this paper, we find all the cardinalities of the sets Dn(T) where T B2. Some of the cardinalities encountered involve inverse binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers. 相似文献
1